Portable High Performance Fft Algorithms
نویسندگان
چکیده
FFT algorithms optimized to achieve high performance on a speciic parallel computer architecture are not portable without a reduction in performance. The main objective of this paper is to present a portable FFT algorithm that runs eeciently on diierent parallel computer systems. This goal can only be achieved if the algorithm is able to adapt itself to the computer system it runs on. The structure of such an \architecture adaptive" FFT algorithm, based on the \four-step" FFT method, is described in this paper.
منابع مشابه
Improving the RX Anomaly Detection Algorithm for Hyperspectral Images using FFT
Anomaly Detection (AD) has recently become an important application of target detection in hyperspectral images. The Reed-Xialoi (RX) is the most widely used AD algorithm that suffers from “small sample size” problem. The best solution for this problem is to use Dimensionality Reduction (DR) techniques as a pre-processing step for RX detector. Using this method not only improves the detection p...
متن کاملVibrotactile Identification of Signal-Processed Sounds from Environmental Events Presented by a Portable Vibrator: A Laboratory Study
Objectives: To evaluate different signal-processing algorithms for tactile identification of environmental sounds in a monitoring aid for the deafblind. Two men and three women, sensorineurally deaf or profoundly hearing impaired with experience of vibratory experiments, age 22-36 years. Methods: A closed set of 45 representative environmental sounds were processed using two transposing (TRH...
متن کاملLow-Energy Radix-2 Serial and Parallel FFT Designs
The push for portable electronics for communication and biomedical applications has accelerated the growing momentum for high performance and low energy hardware implementations of the Fast Fourier Transform (FFT). This work presents several new hardware implementations of the radix-2 FFT algorithms that take advantage of intermittent data and parallelism to reduce the energy per FFT. In the mo...
متن کاملUHFFT: A High Performance DFT Framework
We present a framework for algorithm selection, code generation and optimization for the Fast Fourier Transform. The framework consists of two main parts – the DFT Code Generator (FftGen) and the Execution Scheduler (FftPlanner). The library generator outputs a highly optimized set of small to modest size DFT codelets written in ‘C’. The FftPlanner searches an exponential space of possible algo...
متن کاملA Portable High Performance Multiprecision Package
The author has written a package of Fortran routines that perform a variety of arithmetic operations and transcendental functions on floating point numbers of arbitrarily high precision, including large integers. This package features (1) virtually universal portability, (2) high performance, especially on vector supercomputers, (3) advanced algorithms, including FFT-based multiplication and qu...
متن کامل